/*
 * Saphre - Suffix Arrays for Phrase Extraction
 * Copyright (C) 2013 
 * Dale Gerdemann - Tübingen, Germany 
 * Niko Schenk - Frankfurt am Main, Germany
 * All rights reserved.
 *
 * This program is free software: you can redistribute it and/or modify it under
 * the terms of the GNU General Public License as published by the Free Software
 * Foundation, either version 3 of the License, or (at your option) any later
 * version.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program. If not, see <http://www.gnu.org/licenses/>.
 *
 */
package saphre.commands;

import collectors.api.Collector1;
import collectors.impl.SupPhraseCollector;
import saphre.core.Store;
import saphre.core.SuffixArray;
import util.Interval;
import collectors.impl.visitors.CollectTraversal;

/**
 * Extract "optimal" repeats based on extensions to the left and right
 * with a threshold on mutual information of an n-gram.
 * 
 * @author Niko Schenk
 */
public class CmdSupPhrase {

    public void showSupPhrase(Store store, SuffixArray sa, SuffixArray pa, Interval top, int N) {
        Collector1 collect = new SupPhraseCollector(store, sa, top, N);
        CollectTraversal p =
                new CollectTraversal(store, sa, collect, top);
        p.traverse();
    }
}
